package leetcode;

/**
 * 动态规划：判断自序列
 */
public class Solution65 {
    public boolean isSubsequence(String s, String t) {
        //获取数组长度
        int length1 = s.length();
        int length2 = t.length();
        //定义dp数组
        int[][] dp = new int[length1 + 1][length2 + 1];
        //for循环遍历
        for (int i = 1; i <= length1; i++) {
            for (int j = 1; j <= length2; j++) {
                if (s.charAt(i - 1) == t.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = dp[i][j - 1];  //删除t中的一个元素继续向后遍历
                }
            }
        }
        if (dp[length1][length2] == length1) {
            return true;
        } else {
            return false;
        }
    }
}
